Classically Verifiable NIZK for QMA with Preprocessing
نویسندگان
چکیده
We propose three constructions of classically verifiable non-interactive zero-knowledge proofs and arguments (CV-NIZK) for $$\textbf{QMA}$$ in various preprocessing models.
منابع مشابه
vRAM: Faster Verifiable RAM With Program-Independent Preprocessing
We study the problem of verifiable computation(VC) for RAM programs, where a computationally weak verifieroutsources the execution of a program to a powerful (butuntrusted) prover. Existing efficient implementations of VCprotocols require an expensive preprocessing phase that binds theparties to a single circuit. (While there are schemes that avoidpreprocessing entirely,...
متن کاملImproved Soundness for QMA with Multiple Provers
We present three contributions to the understanding of QMA with multiple provers: • We give a tight soundness analysis of the protocol of [Blier and Tapp, ICQNM ’09], yielding a soundness gap Ω(N−2). Our improvement is achieved without the use of an instance with a constant soundness gap (i.e., without using a “PCP”). • We give a tight soundness analysis of the protocol of [Chen and Drucker, Ar...
متن کاملOn perfect completeness for QMA
Whether the class QMA (Quantum Merlin Arthur) is equal to QMA1, or QMA with onesided error, has been an open problem for years. This note helps to explain why the problem is difficult, by using ideas from real analysis to give a “quantum oracle” relative to which QMA 6= QMA1. As a byproduct, we find that there are facts about quantum complexity classes that are classically relativizing but not ...
متن کاملQMA with Subset State Witnesses
The class QMA plays a fundamental role in quantum complexity theory and it has found surprising connections to condensed matter physics and in particular in the study of the minimum energy of quantum systems. In this paper, we further investigate the class QMA and its related class QCMA by asking what makes quantum witnesses potentially more powerful than classical ones. We provide a definition...
متن کاملPerfect NIZK with Adaptive Soundness
The notion of non-interactive zero-knowledge (NIZK) is of fundamental importance in cryptography. Despite the vast attention the concept of NIZK has attracted since its introduction, one question has remained very resistant: Is it possible to construct NIZK schemes for any NP-language with statistical or even perfect ZK? Groth, Ostrovsky and Sahai recently positively answers to the question by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2022
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-22972-5_21